A counterexample to the pseudo 2-factor isomorphic graph conjecture
نویسندگان
چکیده
منابع مشابه
A counterexample to the pseudo 2-factor isomorphic graph conjecture
A graph G is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of G. Abreu et al. [1] conjectured that K3,3, the Heawood graph and the Pappus graph are the only essentially 4-edge-connected pseudo 2-factor isomorphic cubic bipartite graphs (Abreu et al., Journal of Combinatorial Theory, Series B, 2008, Conjecture 3.6). Using a computer ...
متن کاملPseudo 2-factor isomorphic regular bipartite graphs
A graph is pseudo 2–factor isomorphic if the numbers of circuits of length congruent to zero modulo four in each of its 2–factors, have the same parity. We prove that there exist no pseudo 2–factor isomorphic
متن کاملA Counterexample to Borsuk's Conjecture
Let f(d) be the smallest number so that every set in Rd of diameter 1 can be partitioned into f(d) sets of diameter smaller than 1. Borsuk's conjecture was that f(d)=d+\ . We prove that f(d)>(\.2)^ for large d.
متن کاملIrreducible pseudo 2-factor isomorphic cubic bipartite graphs
A bipartite graph is pseudo 2–factor isomorphic if all its 2–factors have the same parity of number of circuits. In a previous paper we have proved that pseudo 2–factor isomorphic k–regular bipartite graphs exist only for k ≤ 3, and partially characterized them. In particular we proved that the only essentially 4–edge-connected pseudo 2–factor isomorphic cubic bipartite graph of girth 4 is K3,3...
متن کاملA Counterexample to the Finite Height Conjecture
By J onsson's Lemma, the variety V(K) generated by a nite lattice has only nitely many subvarieties. This led to the conjecture that, conversely, if a lattice variety has only nitely many subvarieties, then it is generated by a nite lattice. A stronger form of the conjecture states that a nitely generated variety V(K) has only nitely many covers in the lattice of lattice varieties, and that eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.04.021